Generalised Computational Models for Parallel Multilingual Programming

Recently, a number of proposals have appeared in the literature describing various computational models that allow multilingual programming in a parallel or distributed environment. In this paper we briefly review two of these models that seem very promising, namely Linda based on a shared memory model (Tuple Space) and the Program Composition Notation based on concurrent logic programming. We discuss the common points as well as their differences, and we argue the need for a thorough evaluation of the two models. We then propose the development of a similar formalism based on the generalised computational model of Term Graph Rewriting.